منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA block-iterative quadratic signal recovery algorithm
We propose a block-iterative parallel decomposition method to solve quadratic signal recovery problems under convex constraints. The idea of the method is to disintegrate the original multi-constraint problem into a sequence of simple quadratic minimizations over the intersection of two half-spaces constructed by linearizing blocks of constraints. The implementation of the algorithm is quite ex...
متن کاملA signal recovery algorithm for sparse matrix based compressed sensing
We have developed an approximate signal recovery algorithm with low computational cost for compressed sensing on the basis of randomly constructed sparse measurement matrices. The law of large numbers and the central limit theorem suggest that the developed algorithm saturates the Donoho-Tanner weak threshold for the perfect recovery when the matrix becomes as dense as the signal size N and the...
متن کاملApproximated Function Based Spectral Gradient Algorithm for Sparse Signal Recovery
Numerical algorithms for the l0-norm regularized non-smooth non-convex minimization problems have recently became a topic of great interest within signal processing, compressive sensing, statistics, and machine learning. Nevertheless, the l0norm makes the problem combinatorial and generally computationally intractable. In this paper, we construct a new surrogate function to approximate l0-norm ...
متن کاملModified Papoulis-Gerchberg algorithm for sparse signal recovery
Motivated by the well-known Papoulis-Gerchberg algorithm, an iterative thresholding algorithm for recovery of sparse signals from few observations is proposed. The sequence of iterates turns out to be similar to that of the thresholded Landweber iterations, although not the same. The performance of the proposed algorithm is experimentally evaluated and compared to other state-of-the-art methods.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Vestnik of Samara University. Natural Science Series
سال: 2017
ISSN: 2541-7525
DOI: 10.18287/2541-7525-2017-23-4-25-32